Further improved schedulability analysis of EDF on multiprocessor platforms TR-051001
نویسنده
چکیده
This report shows how to tighten the analysis of global EDF scheduling on multiprocessor platforms, so as to verify the feasibility of a significantly larger range of task systems than has been possible using the previously known tests, including those recently by Bertogna, Cirinei, and Lipari. The improved EDF feasibility test for sporadic task systems with arbitrary deadlines is proven correct, and evaluated in comparison to prior schedulability tests by simulation.
منابع مشابه
Characteristics of EDF Schedulability on Uniform Multiprocessors
In uniform multiprocessor platforms, the various processors comprising the multiprocessor platform may have different computing capacities. The focus of this paper is the design of efficient tests for determining whether the Earliest Deadline First Scheduling Algorithm (EDF) can successfully schedule a given real-time task system to meet all deadlines upon a specified uniform multiprocessor pla...
متن کاملA Comparison of Global and Partitioned EDF Schedulability Tests for Multiprocessors TR-051101
This paper compares the performance of several variations on EDF-based global and partitioned multiprocessor scheduling algorithms, together with their associated feasibility tests, on a variety of pseudo-randomly chosen sets of sporadic tasks. A new hybrid EDF-based scheme is shown to perform better than previously studied priority-based global scheduling schemes, though not as well as EDF-bas...
متن کاملGlobal DM schedulability analysis: upper and lower bounds∗
A new technique was recently introduced [7] for the analysis of real-time systems scheduled on multiprocessor platforms by the global Earliest Deadline First (EDF) scheduling algorithm. In this paper, this technique is adapted and applied to the schedulability analysis of realtime systems scheduled on multiprocessor platforms by the global Deadline-Monotonic (DM) scheduling algorithm. It is sho...
متن کاملThe Multi Supply Function Resource Abstraction for Multiprocessors: the Global EDF case
Abstractions are powerful models that allow to isolate the applications as well as to port an existing applications onto new platforms. At the same time, the multiprocessor will become the dominant computing device in the near future. The paper proposes a technique to abstract to computing power of a parallel machine. We compare with the existing abstractions and we develop the global EDF sched...
متن کاملExact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms
In this paper, we study the global scheduling of periodic task systems on unrelated multiprocessor platforms. We first show two general properties which are well known for uniprocessor platforms and which are also true for unrelated multiprocessor platforms: (i) under few and not so restrictive assumptions, we prove that feasible schedules of periodic task systems are periodic starting from som...
متن کامل